We study the Order acceptance, scheduling, and pricing problem (OASP) in a parallel machine environment. Each Order is characterized by due date, release date, deadline, controllable processing time, sequence-dependent setup time, and price in MTO system. An MILP formulation is used to maximize the net profit. Then, under a joint optimization approach, the pricing decisions are set for the unrelated parallel machine environment. The results show that the proposed model can solve the scheduling decision problems based on different levels of products’ prices. Thus, the model solves these two categories of decisions, simultaneously. Moreover, the changes in accepted Orders in pricing levels can be analyzed regarding their dependency on price elasticity of items for future research.